Approximating Fixation Probabilities in the Generalized Moran Process

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Can Fixation be Guaranteed in the Generalized Moran Process?

The Moran process models the spread of genetic mutations through a population. A mutant with relative fitness r is introduced into a population and the system evolves, either reaching fixation (in which every individual is a mutant) or extinction (in which none is). In a widely cited paper (Nature, 2005), Lieberman, Hauert and Nowak generalize the model to populations on the vertices of graphs....

متن کامل

Stochastic Evolution as a Generalized Moran Process

This paper proposes and analyzes a model of stochastic evolution in finite populations. The expected motion in our model resembles the standard replicator dynamic when the population is large, but is qualitatively different when the population size is small, due to the difference between maximizing payoff and maximizing relative payoff. Moreover, even in large populations the asymptotic behavio...

متن کامل

The Moran model with selection: fixation probabilities, ancestral lines, and an alternative particle representation.

We reconsider the Moran model in continuous time with population size N, two allelic types, and selection. We introduce a new particle representation, which we call the labelled Moran model, and which has the same distribution of type frequencies as the original Moran model, provided the initial values are chosen appropriately. In the new model, individuals are labelled 1,2,…,N; neutral resampl...

متن کامل

Approximating Solution Probabilities in CSPs

Heuristics for variable and value ordering have proven useful in searching for solutions to constraint satisfaction problem (CSPs). A well-known heuristic guides the search by ordering values based on an estimate of the number of solutions for the problem. In this paper, we introduce a new estimation method that approximates the probability that a given variable/value combination is part of a g...

متن کامل

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs

Evolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider the classical birth-death Moran process where there are two types of individuals, namely, the residents with fitness 1 and mutants with fitness r. The fitness...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithmica

سال: 2012

ISSN: 0178-4617,1432-0541

DOI: 10.1007/s00453-012-9722-7